Constrained path finding in biochemical networks
نویسندگان
چکیده
The analysis of biochemical networks is mainly done using relational or procedural languages. Combining or designing new analyses requires lot of programming effort that cannot be reused for other analyses. To overcome these limitations, we introduce CP(BioNet) a new constraint programming domain for the analysis of biochemical networks. Analyses are formulated using constraints over graph domain variables. The constraints are then solved by a constraint solver designed for biochemical networks. This provides a flexible and powerful approach as simple analyses can then easily be combined to form complex ones. We focus here on constrained path finding, finding a path from node A to node B in a graph with additional constraints, such as requiring this path to include a predefined set of mandatory intermediate nodes. Constraints for path finding are introduced and their implementation (propagators) is described. A prototype is presented and constrained path finding experiments are performed and analyzed to illustrate the benefits of this new approach.
منابع مشابه
Constrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملConstrained Consumable Resource Allocation in Uncertain Project Networks with Fuzzy Activity Duration
متن کامل
The Minimum Cost Path Finding Algorithm Using a Hopfield Type Neural Network
Recently neural networks have been ploposed as new computational tools for solving constrained optimization problems. In this paper the minimum cost path fmding algorithm is proposed by using a Hopfield type neural network. In order to design a Hopfield type neural network, an energy function must be defmed at f i t . To achieve thii, the concept of a vector-represented network is used to descr...
متن کاملConstrained metabolic network analysis: discovering pathways using CP(Graph)
Biochemical networks – networks composed of the building blocks of the cell and their interactions are qualitative descriptions of the working of the cell. Such networks can be modeled as graphs. Metabolic networks are typical examples of such networks. They are composed of biochemical entities participating to reactions as substrates or products. Such a network can be modeled as a bipartite di...
متن کامل